Proof Planning, a Measurement for Effective Interactive Program Synthesis?

نویسنده

  • Anna-Lena Johansson
چکیده

In this paper we suggest measures for making the synthesis process more likely to succeed. As a first measure the synthesis task must be made intelligible by making the starting point, the way of reasoning, and criterion for conclusion of the synthesis clear. Secondly, the interactive synthesis process can be supported by a planning ingredient in the system as a way for the system and the user to communicate. The planning ingredient in a case study prototype system, IPSA, takes the role of both describing the performed synthesis steps as well as prescribing the future steps. The plan orders the inference steps in sequences of specific subtasks. There are four types of subtasks, three of which the system can perform without help and the fourth where the knowledge of the user has to be incorporated into the synthesis process. This is a way to make a effective distribution of the workload of the synthesis process between the system and the user.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof Planning and Program Synthesis: A Survey

Proof planning is a knowledge-based automated theorem proving t~hnlque. It has been applied to a number of theorem-proving domains, for example: mathematical induction (Bundy et al.1991), and hardware verification (Cantu et a/.1996) (to pick two of the many). In the domain of program synthesis, it has been used to automate the synthesis of logic (Kraan et a/.1993a, Kraan et al.1993b, Basin et a...

متن کامل

Middle - Out Reasoning for Synthesis and InductionIna

We develop two applications of middle-out reasoning in inductive proofs: Logic program synthesis and the selection of induction schemes. Middle-out reasoning as part of proof planning was rst suggested by Bundy et al Bundy et al 90a]. Middle-out reasoning uses variables to represent unknown terms and formulae. Uniication instantiates the variables in the subsequent planning, while proof plannin...

متن کامل

Max-planck-institut F Ur Informatik Middle-out Reasoning for Logic Program Synthesis K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses

Logic programs can be synthesized as a by-product of the planning of their veri cation proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate t...

متن کامل

Middle-Out Reasoning for Logic Program Synthesis

Logic programs can be synthesized as a by-product of the planning of their verification proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate ...

متن کامل

ITAS : A Portable , Interactive Transportation Scheduling

In a joint project, BBN and Kestrel Institute have developed a prototype of a mixed-initiative scheduling system called ITAS (In-Theater Airlift Scheduler) for the U.S. Air Force, Paciic Command. The system was built in large part using the KIDS (Kestrel Interactive Development System) program synthesis tool. In previous work for the ARPA/Rome Laboratory Planning Initiative (ARPI), Kestrel has ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007